A Sequential Approximation Method Using Neural Networks for Nonlinear Discrete-Variable Optimization with Implicit Constraints.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

A regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method

The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...

متن کامل

Weight reduction of aluminum disc wheels under fatigue constraints using a sequential neural network approximation method

This paper describes a weight reduction problem of aluminum disc wheels under cornering fatigue constraints. It is a special structural optimization problem because of the existence of the implicit fatigue constraint. A sequential neural network approximation method is presented to solve this type of discrete-variable engineering optimization problems. First a back-propagation neural network is...

متن کامل

A Neural Network for Nonlinear Optimization with General Linear Constraints

In this study, we investigate a novel neural network for solving nonlinear convex programming problems with general linear constraints. Furthermore, we extend this neural network to solve a class of variational inequalities problems. These neural networks are stable in the sense of Lyapunov and globally convergent to a unique optimal solution. The present convergence results do not requires Lip...

متن کامل

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JSME International Journal Series C

سال: 2001

ISSN: 1344-7653,1347-538X

DOI: 10.1299/jsmec.44.103